A Systematic Approach to Develop Efficient Complete Exchange Algorithms for Meshes and Tori

نویسندگان

  • Luis Díaz de Cerio
  • Miguel Valero-García
  • Antonio González
چکیده

Many authors have considered the design of complete exchange algorithms for a variety of multicomputer models, including hypercubes, multidimensional meshes and tori with different port and message switching models. Frequently, algorithms for a given multicomputer architecture cannot be used (or are not efficient) for a different architecture. This paper presents a method which allows the systematic design of complete exchange algorithms for a wide range of multicomputer architectures, including the cases usually considered in the literature and some other architectures that may be interesting in the future. Performance figures obtained by analytical models show that algorithms obtained through the proposed method are efficient for almost all the multicomputer models under consideration and outperform the best known algorithms for a significant range of the problem and system parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. Several complete exchange algorithms have been proposed in the literature for wormhole meshes. However, these algorithms, when applied to tori, can not take advantage of wrap-around interconnections to implement complete exchange with reduced latency. In this paper, a new...

متن کامل

Bandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/Torus Networks: A Diagonal-Propagation Approach

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. Several complete exchange algorithms have been proposed in the literature for wormhole meshes. However, these algorithms, when applied to tori, can not take advantage of wrap-around interconnections to implement complete exchange with reduced latency. In this paper, a new...

متن کامل

RACE: A Software-Based Fault Tolerance Scheme for Systematically Transforming Ordinary Algorithms to Robust Algorithms

We propose the robust algorithm-configured emulation (RACE) scheme for efficient parallel computation and communication in the presence of faults. A wide variety of algorithms originally designed for fault-free meshes, tori, and k-ary n-cubes can be transformed to corresponding robust algorithms through RACE. In particular, optimal robust algorithms can be derived for total exchange (TE) and as...

متن کامل

Routing and Embeddings in Cyclic Petersen Networks: An Efficient Extension of the Petersen Graph

The Petersen graph is a Moore graph that has node degree 3, diameter 2, and optimal network size 10. In this paper, we present a class of interconnection networks, called cyclic Petersen networks (CPNs), which efficiently extend the Petersen graph to obtain larger networks with small diameter and node degree. We derive balanced routing algorithms and efficient embeddings for CPNs. In particular...

متن کامل

ART: Robustness of Meshes and Tori for Parallel and Distributed Computation

In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumption is made about the availability of a complete submesh or subtorus. Based on ARTs, a very wide variety of problems, including sorting, FFT, total exchange, permutation, and some matrix operations, can be solved with a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997